Concept abduction for semantic matchmaking in distributed and modular ontologies

نویسندگان

  • Viet-Hoang Vu
  • Nhan Le Thanh
چکیده

Recently, attempts have been done to formalize Semantic Matchmaking, the process of finding potential matches between demands and supplies based on their logical relations with reference to a common ontology, in Description Logics (DLs). We extend the formalization to Packages-based Description Logics (P-DLs), modular extensions of DLs, in order to perform the matchmaking operation in contexts where descriptions of demands and supplies are specified in different terminologies.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semantic Matchmaking as Non-Monotonic Reasoning: A Description Logic Approach

Matchmaking arises when supply and demand meet in an electronic marketplace, or when agents search for a web service to perform some task, or even when recruiting agencies match curricula and job profiles. In such open environments, the objective of a matchmaking process is to discover best available offers to a given request. We address the problem of matchmaking from a knowledge representatio...

متن کامل

Concept Abduction in Description Logics with Cardinality Restrictions

Recently the usefulness of Concept Abduction, a novel non-monotonic inference service for Description Logics (DLs), has been argued in the context of ontology-based applications such as semantic matchmaking and resource retrieval. Based on tableau calculus, a method has been proposed to realize this reasoning task in ALN , a description logic that supports simple cardinality restrictions as wel...

متن کامل

A Uniform Tableaux-Based Approach to Concept Abduction and Contraction in ALN

We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, showing that the upper bound of our approach meets the complexity lower bound. The work is motivated by the need to offer a uniform approach to reasoning services useful in semantic-based matchmaking scenarios.

متن کامل

Mobile Semantic-Based Matchmaking: A Fuzzy DL Approach

Novel wireless handheld devices allow the adoption of revised and adapted discovery approaches originally devised for the Semantic Web in mobile ad-hoc networks. Nevertheless, capabilities of such devices require an accurate re-design of frameworks and algorithms to efficiently support mobile users. The paper focuses on an implementation of concept abduction and contraction algorithms in (fuzzy...

متن کامل

Extending Semantic-Based Matchmaking via Concept Abduction and Contraction

Motivated by the need to extend features of semantic matchmaking between request and offer descriptions, a model is presented that exploits recently proposed non-standard inference services in Description Logics. The model allows to manage negotiable and strict constraints of a request (equivalently of an offer) while performing a matchmaking process, even if both the request and the offer are ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010